#include<iostream>
#include<vector>
#include<queue>
#include<cstring>
#include<cmath>
#include<map>
#include<set>
#include<cstdio>
#include<algorithm>
#define debug(a) cout<<#a<<"="<<a<<endl;
using namespace std;
const int maxn=2e5+1000;
typedef long long LL;
inline LL read(){LL x=0,f=1;char ch=getchar();	while (!isdigit(ch)){if (ch=='-') f=-1;ch=getchar();}while (isdigit(ch)){x=x*10+ch-48;ch=getchar();}
return x*f;}
LL a[maxn],b[maxn],ans[maxn],p[maxn];
int main(void){
   cin.tie(0);std::ios::sync_with_stdio(false);
   LL t;cin>>t;
   while(t--){
     LL n;cin>>n;
     LL c;cin>>c;
     for(LL i=1;i<=n;i++) cin>>a[i];
     for(LL i=1;i<n;i++) cin>>c[i];
     ans[1]=a[1];
     p[1]=1;
     for(LL i=2;i<=n;i++){
        p[i]=p[i-1]+1;
        if(ans[i-1]>=b[i-1]){
            ans[i]=ans[i-1]-b[i-1];
            continue;
        }

        LL temp=b[i-1]-res[i-1];
        LL o=temp/a[i-1];
        if(t%a[i-1]!=0) o++;
        p[i]+=o;
        ans[i]=ans[i-1]+
     }
   }
   return 0;
}
